#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)
#define FOR(i,a,b) for (int i = a; i <= b; i ++)
#define DOW(i,a,b) for (int i = b; i >= a; -- i)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

int cnt[10];

inline void solution() {
    for (int i = 0; i < 10; i ++ ) cnt[i] = 2021;
    int i;
    for (i = 1;; i ++ ) {
        int t = i;
        while (t) {
            if (cnt[t % 10] == 0) {
                cout << i - 1 << endl;
                return ;
            }
            cnt[t % 10] --;
            t /= 10;
        }
    }
}

int main() {
    // freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}